On nilpotency and residual finiteness in semigroups
نویسندگان
چکیده
منابع مشابه
Reflections on the residual finiteness of one-relator groups
Let G D ha; b; : : : j r D 1i be a one-relator group equipped with at least two generators. For all w which do not commute with r in the ambient free group on the generators a, b, ..., the groups G.r;w/ D ha; b; : : : j rrw D r2i are not residually finite and have the same finite images as G. The existence of this family of one-relator groups which are not residually finite reinforces what is b...
متن کاملBounding the Residual Finiteness of Free Groups
We find a lower bound to the size of finite groups detecting a given word in the free group. More precisely we construct a word wn of length n in non-abelian free groups with the property that wn is the identity on all finite quotients of size ∼ n2/3 or less. This improves on a previous result of BouRabee and McReynolds quantifying the lower bound of the residual finiteness of free groups. A gr...
متن کاملOn the residual finiteness of outer automorphisms of hyperbolic groups
We show that every virtually torsion-free subgroup of the outer automorphism group of a conjugacy separable hyperbolic group is residually finite. As a result, we are able to prove that the group of outer automorphisms of every finitely generated Fuchsian group and of every free-by-finite group is residually finite.
متن کاملOn Nilpotency and Asymptotic Nilpotency of Cellular Automata
One of the most interesting aspects in the theory of cellular automata is the study of different types of nilpotency, that is, different ways in which a cellular automaton can force a particular symbol (usually called 0) to appear frequently in all its spacetime diagrams. The simplest such notion, called simply ‘nilpotency’, is that the cellular automaton c maps every configuration to a uniform...
متن کاملThe finiteness problem for automaton semigroups is undecidable
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct a Mealy automaton, such that the plane admits a valid Wang tiling if and only if the Mealy autom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1972
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1972.42.693